dynamic tree - significado y definición. Qué es dynamic tree
Diclib.com
Diccionario ChatGPT
Ingrese una palabra o frase en cualquier idioma 👆
Idioma:

Traducción y análisis de palabras por inteligencia artificial ChatGPT

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

  • cómo se usa la palabra
  • frecuencia de uso
  • se utiliza con más frecuencia en el habla oral o escrita
  • opciones de traducción
  • ejemplos de uso (varias frases con traducción)
  • etimología

Qué (quién) es dynamic tree - definición

DATA STRUCTURE FOR REPRESENTING A FOREST, A SET OF ROOTED TREES
Link-cut tree; Link cut tree; Dynamic tree; Dynamic trees
  • Demonstrating how nodes are stored by depth in the link-cut tree
  • During an access old preferred paths are broken and replaced with path-parent pointers, while the accessed node is splayed to the root of the tree
  • Showing how a link cut tree transforms preferred paths into a forest of trees.

Aerospool WT9 Dynamic         
  • Aerospool WT9 Dynamic with fixed landing gear
  • Aerospool WT9 Dynamic with retractable gear
  • Aerospool WT9 Dynamic in flight
LIGHT SPORT AIRCRAFT BY AEROSPOOL IN SLOVAKIA
Aerospool WT 9 Dynamic; Aerospool WT-9 Dynamic; Aerospool Dynamic
The Aerospool WT9 Dynamic is a Slovak ultralight and light-sport aircraft, designed and produced by Aerospool of Prievidza. The aircraft is supplied as a complete ready-to-fly-aircraft.
dynamic analysis         
METHOD OF ANALYSING THE IMPACT OF FISCAL POLICY CHANGES BY FORECASTING THE EFFECTS OF ECONOMIC AGENTS' REACTIONS TO INCENTIVES CREATED BY POLICY
Dynamic analysis
<programming> Evaluation of a program based on its execution. Dynamic analysis relies on executing a piece of software with selected test data. (1996-05-13)
Dynamic scoring         
METHOD OF ANALYSING THE IMPACT OF FISCAL POLICY CHANGES BY FORECASTING THE EFFECTS OF ECONOMIC AGENTS' REACTIONS TO INCENTIVES CREATED BY POLICY
Dynamic analysis
Dynamic scoring is a forecasting technique for government revenues, expenditures, and budget deficits that incorporates predictions about the behavior of people and organizations based on changes in fiscal policy, usually tax rates. Dynamic scoring depends on models of the behavior of economic agents which predict how they would react once the tax rate or other policy change goes into effect.

Wikipedia

Link/cut tree


A link/cut tree is a data structure for representing a forest, a set of rooted trees, and offers the following operations:

  • Add a tree consisting of a single node to the forest.
  • Given a node in one of the trees, disconnect it (and its subtree) from the tree of which it is part.
  • Attach a node to another node as its child.
  • Given a node, find the root of the tree to which it belongs. By doing this operation on two distinct nodes, one can check whether they belong to the same tree.

The represented forest may consist of very deep trees, so if we represent the forest as a plain collection of parent pointer trees, it might take us a long time to find the root of a given node. However, if we represent each tree in the forest as a link/cut tree, we can find which tree an element belongs to in O(log(n)) amortized time. Moreover, we can quickly adjust the collection of link/cut trees to changes in the represented forest. In particular, we can adjust it to merge (link) and split (cut) in O(log(n)) amortized time.

Link/cut trees divide each tree in the represented forest into vertex-disjoint paths, where each path is represented by an auxiliary data structure (often splay trees, though the original paper predates splay trees and thus uses biased binary search trees). The nodes in the auxiliary data structure are ordered by their depth in the corresponding represented tree. In one variation, Naive Partitioning, the paths are determined by the most recently accessed paths and nodes, similar to Tango Trees. In Partitioning by Size paths are determined by the heaviest child (child with the most children) of the given node. This gives a more complicated structure, but reduces the cost of the operations from amortized O(log n) to worst case O(log n). It has uses in solving a variety of network flow problems and to jive data sets.

In the original publication, Sleator and Tarjan referred to link/cut trees as "dynamic trees", or "dynamic dyno trees".